Cyclic self-dual codes
نویسندگان
چکیده
Ahstruct-It is shown that if the automorphism group of a binary self-dual code satisfies a certain condition then the code contains words of weight congruent to 2 modulo 4. In particular, no cyclic binary self-dual code can have all its weights divisible by four. The number of cyclic binary self-dual codes of length n is determined, and the shortest nontrivial code in this class is shown to have length 14.
منابع مشابه
On Euclidean and Hermitian Self-Dual Cyclic Codes over $\mathbb{F}_{2^r}$
Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing [5] as well as Kai and Zhu [7] proved that Euclidean self-dual cyclic codes of length n over Fq exist if and only if n is even and q = 2 , where r is any positive integer. For n and q even, there always exists an [n, n 2 ] self-dual cyclic code with generator polynomial x n 2 + 1 called the trivial se...
متن کاملIsometrically Self-dual Cyclic Codes
General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and sufficient condition for the existence of isometrically selfdual cyclic codes is obtained. A program to construct isometrically selfdual cyclic codes is provid...
متن کاملSelf-Dual Cyclic and Quantum Codes Over Z2^{\alpha} x (Z2 + uZ2)^{\beta}
In this paper we introduce self-dual cyclic and quantum codes over Zα2 × (Z2 + uZ2) . We determine the conditions for any Z2Z2[u]-cyclic code to be self-dual, that is, C = C. Since the binary image of a selforthogonal Z2Z2[u]-linear code is also a self-orthogonal binary linear code, we introduce quantum codes over Zα2 × (Z2 + uZ2) β . Finally, we present some examples of self-dual cyclic and qu...
متن کاملNew MDS Euclidean and Hermitian self-dual codes over finite fields
In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and constacyclic codes. And we give some results on Hermitian self-dual codes, which are the extended cyclic duadic codes.
متن کاملHermitian Self-Dual Cyclic Codes of Length $p^a$ over $GR(p^2, s)$
In this paper, we study cyclic codes over the Galois ring GR(p, s). The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length pa over GR(p, s). Combining with some known results and the standard Discrete Fourier Transform decomposition, we arrive at the characterization and enumeration of Euclidean self-dual cyclic codes of any length over GR(p, s). S...
متن کاملConstruction of quasi-cyclic self-dual codes
There is a one-to-one correspondence between l-quasi-cyclic codes over a finite field Fq and linear codes over a ring R = Fq[Y ]/(Y m − 1). Using this correspondence, we prove that every l-quasi-cyclic self-dual code of length ml over a finite field Fq can be obtained by the building-up construction, provided that char (Fq) = 2 or q ≡ 1 (mod 4), m is a prime p, and q is a primitive element of F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 1983